Propositional defeasible logic has linear complexity
نویسندگان
چکیده
منابع مشابه
Propositional Defeasible Logic has Linear Complexity
19 and has undergone a preliminary experimental evaluation [23]. It executes simple, but large, theories of basic defeasible logic very quickly. The linear complexity of the algorithm is supported empirically. However, the transformations used to convert an arbitrary defeasible theory to the appropriate form for the algorithm of Figure 1 impose a large constant factor, particularly on the cost ...
متن کاملPropositional Defeasible Logic has Linear Complexity
Defeasible logic is a rule-based nonmonotonic logic, with both strict and defeasible rules, and a priority relation on rules. We show that inference in the propositional form of the logic can be performed in linear time. This contrasts markedly with most other propositional nonmonotonic logics, in which inference is intractable.
متن کاملPropositional Clausal Defeasible Logic
Defeasible logics are non-monotonic reasoning systems that have efficient implementations and practical applications. We list several desirable properties and note that each defeasible logic fails to have some of these properties. We define and explain a new defeasible logic, called clausal defeasible logic (CDL), which has all these properties. CDL is easy to implement, consistent, detects loo...
متن کاملOn the Complexity of Temporal Defeasible Logic
In this paper we investigate the complexity of temporal defeasible logic, and we propose an efficient algorithm to compute the extension of a temporalised defeasible theory. We motivate the logic showing how it can be used to model deadlines.
متن کاملProof Complexity of Intuitionistic Propositional Logic
We explore the proof complexity of intuitionistic propositional logic (IPL). The problem of determining whether or not an intuitionistic formula is valid is PSPACE-Complete via a reduction from QBF . In view of this reduction (due to Statman), it is natural to compare the proof-theoretic strength of a standard axiomatic system for IPL with a similar proof system for classical quantified Boolean...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory and Practice of Logic Programming
سال: 2001
ISSN: 1471-0684,1475-3081
DOI: 10.1017/s1471068401001168